Universitat Passau Fakult at Ff Ur Mathematik Und Informatik P Chaotic Fixed Point Iterations

نویسندگان

  • Alfons Geser
  • Jens Knoop
چکیده

In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity is required. We demonstrate the power and versatility of our xed point theorem, which under the wellfoundedness condition covers all the known `synchronous' versions of xed point theorems, by means of applications in data ow analysis and program optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universitat Passau Fakult at F Ur Mathematik Und Informatik P Chaotic Fixed Point Iterations

In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...

متن کامل

Universitat Passau Fakult at F Ur Mathematik Und Informatik P Module Connguration by Minimal Model Construction

We present a framework for the automatic con guration of large systems from a library of reusable software components. Core of the framework is a modal logic that uniformly and elegantly captures type descriptions, module speci cations and relative time. Whereas the rst two `dimensions' are treated similarly by means of a simple logic over a taxonomy of types and modules respectively, time is e...

متن کامل

Universitat Passau Fakult at F Ur Mathematik Und Informatik P Constant Propagation in Explicitly Parallel Programs 1

Constant propagation (CP) is a powerful, practically relevant optimization of sequential programs. However, only few approaches have been proposed aiming at making CP available for parallel programs. In fact, because of the computational complexity paraphrased by the catch-phrase \state explosion problem," the successful transfer of sequential techniques is currently essentially restricted to b...

متن کامل

Universitat Passau Fakult at F Ur Mathematik Und Informatik P Code Motion and Code Placement: Just Synonyms?

We prove that there is no di erence between code motion (CM ) and code placement (CP) in the traditional syntactic setting, however, a dramatic di erence in the semantic setting. We demonstrate this by re-investigating semantic CM under the perspective of the recent development of syntactic CM. Besides clarifying and highlightening the analogies and essential di erences between the syntactic an...

متن کامل

Universitat Passau Fakult at F Ur Mathematik Und Informatik P Eliminating Partially Dead Code in Explicitly Parallel Programs 1

Eliminating partially dead code has proved to be a powerful technique for the runtime optimization of sequential programs. In this article, we show how this technique can be adapted to explicitly parallel programs with shared memory and interleaving semantics on the basis of a recently presented framework for e cient and precise bitvector analyses for this program setting. Whereas the framework...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994